/*
 * Author  : Pallab
 * Program : A.cxx
 * 
 * Fri Jul 20 01:24:06 2012
 *
 * I have not failed, I have just found 10000 ways that won't work.
 *
 */
 
#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <bitset>
#include <iomanip>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstdlib>

using namespace std;


#define foR(i1,st,ed) for(int i1 = st , j1 = ed ; i1 < j1 ; ++i1 )
#define fo(i1,ed) foR( i1 , 0 , ed )
#define foE(i1,st,ed) foR( i1, st, ed+1 )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )
#define line putchar('\n')

template<class T1>
inline void debug(T1 _x) {
    cout<<_x<<'\n';
}
template<class T1, class T2>
inline void debug(T1 _x,T2 _y) {
    cout<<_x<<' '<<_y<<'\n';
}
template<class T1, class T2, class T3>
inline void debug(T1 _x,T2 _y,T3 _z) {
    cout<<_x<<' '<<_y<<' '<<_z<<'\n';
}
template<class T1, class T2, class T3, class T4>
inline void debug(T1 _x,T2 _y,T3 _z,T4 _zz) {
    cout<<_x<<' '<<_y<<' '<<_z<<' '<<_zz<<'\n';
}
template< class T1>
inline void debug(T1 _array,int _size) {
    cout<<"[";
    for (int i=0; i<_size; ++i) {
        cout<<' '<<_array[i];
    }
    puts(" ]");
}

inline bool CI(int &_x) {
    return scanf("%d",&_x)==1;
}
inline bool CI(int &_x, int &_y) {
    return CI(_x)&&CI(_y) ;
}
inline bool CI(int &_x, int &_y, int &_z) {
    return CI(_x)&&CI(_y)&&CI(_z) ;
}
inline bool CI(int &_x, int &_y, int &_z, int &_zz) {
    return CI(_x)&&CI(_y)&&CI(_z)&&CI(_zz) ;
}
inline void wait( double seconds ) {
    double endtime = clock()+( seconds* CLOCKS_PER_SEC );
    while ( clock() < endtime ) {
        ;
    }
}
const int mxn = 10000;
Int dp[mxn][11];
bool q[mxn];

Int go(int at, int k){
	if(k==0)return 1LL;
	if(at==0)return 0LL;
	
	Int& var=dp[at][k];
	if(var!=-1)return var;
	var=0LL;
	var+=go(at-1,k);
	var+=go(at-1,k-1);
	return var;
}

//#define debug
inline void main2(Int nth,int k){
	SET(dp,-1);
	int from;
	int prothom=1;
	for(int i=0;i<mxn;++i){
		Int result = go(i,k);
		#ifdef debug
			printf("len,k,result=>%d,%d,%lld,%lld\n",i,k,result,nth);
			wait(1);
		#endif
		if(result>=nth){
			nth = nth-go(i-1,k);
			if(prothom){
				from=i;
				prothom=0;
			}
			q[i]=true;
			--k;
			i=-1;
		}
		if(nth<=0||k<=0)break;
	}
	for(int i=from;i>0;--i)
		putchar(q[i]?'1':'0');
	
}
int main(){
	int nth;
	int k;
	CI(nth,k);
	if(k==1){
		putchar('1');
		for(int i=2;i<=nth;++i)
			putchar('0');
	}
	else{
		main2(nth,k);
	}
	line;
	
return 0;
}
